Prior Agreement: Arbitration or Arbitrary?

Coordination Without Prior Agreement

Assuming that there is an a priori agreement between processes on the names of shared memory locations, as done in almost all the publications on shared memory algorithms, is tantamount to assuming that agreement has already been solved at the lower-level. From a theoretical point of view, it is intriguing to €gure out how coordination can be achieved without relying on such lower-level agreeme...

Arbitration (or How to Merge Knowledge Bases)

Knowledge-based systems must be able to “intelligently” manage a large amount of information coming from different sources and at different moments in time. Intelligent systems must be able to cope with a changing world by adopting a “principled” strategy. Many formalisms have been put forward in the AI and DB literature to address this problem. Among them, belief revision is one of the most su...

Arbitrary Stat Notices in Valuation Cases , or Arbitrary Ninth Circuit ?

Weighted ℓ1-Minimization for Sparse Recovery under Arbitrary Prior Information

Weighted l1-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In this work, we study the recovery conditions and the associated recovery guarantees of weighted l1-minimization when arbitrarily many distinct weights are permitted. ...

Weighted $\ell_1$-Minimization for Sparse Recovery under Arbitrary Prior Information

Weighted l1-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In this work, we study the recovery conditions and the associated recovery guarantees of weighted l1-minimization when arbitrarily many distinct weights are permitted. ...